Computing Arrangements of Implicit Curves

نویسندگان

  • PAULO CEZAR CARVALHO
  • LUIZ HENRIQUE DE FIGUEIREDO
  • PAULO ROMA CAVALCANTI
چکیده

We examine the problem of determining, when possible, the exact topological adjacency structure of the planar subdivision induced on a rectangle by a set of curves given in implicit form. This means finding the number of points of intersection of the curves and the way curve segments are linked to determine regions. We use a recursive method based on estimates given by interval arithmetic, together with conditions under which topology can be exactly determined.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arrangements of Planar Curves

Computing arrangements of curves is a fundamental and challenging problem in computational geometry as leading to many practical applications in a wide range of fields, especially in robot motion planning and computer vision. In this survey paper we present the state of the art for computing the arrangement of planar curves, considering various classes of curves, from lines to arbitrary curves.

متن کامل

Jacobi Curves: Computing the Exact Topology of Arrangements of Non-singular Algebraic Curves

We present an approach that extends the BentleyOttmann sweep-line algorithm [3] to the exact computation of the topology of arrangements induced by non-singular algebraic curves of arbitrary degrees. Algebraic curves of degree greater than 1 are difficult to handle in case one is interested in exact and efficient solutions. In general, the coordinates of intersection points of two curves are no...

متن کامل

Robust Geometric Computations for Vision and Robotics

A new technique, the hidden variable method, is described for the creation of robust geometric algorithms: algorithms which can be implemented with absolute reliability using rounded nite precision arithmetic. The speciic application given here is an algorithm for computing arrangements of line segments in two dimensions: determining how a set of line segments subdivides the plane into vertices...

متن کامل

Algorithms for Trigonometric Curves (Simplification, Implicitization, Parameterization)

A trigonometric curve is a real plane curve where each coordinate is given parametri-cally by a truncated Fourier series. The trigonometric curves frequently arise in various areas of mathematics, physics, and engineering. Some trigonometric curves can be also represented implicitly by bivariate polynomial equations. In this paper, we give algorithms for (a) simplifying a given parametric repre...

متن کامل

Computing the Combinatorial Structure of Arrangements of Curves Using Polygonal Approximations

Dans cet article, nous pr esentons une m ethode de calcul du graphe d'incidence d'un arrangement de courbes. L'id ee principale de notre approche est d' eviter la r esolution d equations alg ebriques, car cette r esolution ne peut pas ^ etre eeectu ee de mani ere exacte. Pour atteindre notre but, nous utilisons deux approximations polygonales pour chaque courbe de l'arrangement et nous etabliss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007